An Efficient Neurodynamic Scheme for Solving a Class of Nonconvex Nonlinear Optimization Problems
Authors
Abstract:
By p-power (or partial p-power) transformation, the Lagrangian function in nonconvex optimization problem becomes locally convex. In this paper, we present a neural network based on an NCP function for solving the nonconvex optimization problem. An important feature of this neural network is the one-to-one correspondence between its equilibria and KKT points of the nonconvex optimization problem. the proposed neural network is proved to be stable and convergent to an optimal solution of the original problem. Finally, an examples is provided to show the applicability of the proposed neural network.
similar resources
An efficient improvement of the Newton method for solving nonconvex optimization problems
Newton method is one of the most famous numerical methods among the line search methods to minimize functions. It is well known that the search direction and step length play important roles in this class of methods to solve optimization problems. In this investigation, a new modification of the Newton method to solve unconstrained optimization problems is presented. The significant ...
full textAn efficient one-layer recurrent neural network for solving a class of nonsmooth optimization problems
Constrained optimization problems have a wide range of applications in science, economics, and engineering. In this paper, a neural network model is proposed to solve a class of nonsmooth constrained optimization problems with a nonsmooth convex objective function subject to nonlinear inequality and affine equality constraints. It is a one-layer non-penalty recurrent neural network based on the...
full textA numerical scheme for solving nonlinear backward parabolic problems
In this paper a nonlinear backward parabolic problem in one dimensional space is considered. Using a suitable iterative algorithm, the problem is converted to a linear backward parabolic problem. For the corresponding problem, the backward finite differences method with suitable grid size is applied. It is shown that if the coefficients satisfy some special conditions, th...
full texta numerical scheme for solving nonlinear backward parabolic problems
in this paper a nonlinear backward parabolic problem in one dimensional space is considered. using a suitable iterative algorithm, the problem is converted to a linear backward parabolic problem. for the corresponding problem, the backward finite differences method with suitable grid size is applied. it is shown that if the coefficients satisfy some special conditions, th...
full textAn efficient approach for solving layout problems
This paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. By this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. This is resulted from dividing area into discrete and continuous dimensions. Also defining decision var...
full textAn Efficient Numerical Method for a Class of Boundary Value Problems, Based on Shifted Jacobi-Gauss Collocation Scheme
We present a numerical method for a class of boundary value problems on the unit interval which feature a type of exponential and product nonlinearities. Also, we consider singular case. We construct a kind of spectral collocation method based on shifted Jacobi polynomials to implement this method. A number of specific numerical examples demonstrate the accuracy and the efficiency of the propos...
full textMy Resources
Journal title
volume 8 issue 4 (FALL)
pages 255- 258
publication date 2018-09-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023